Unit Fraction

A unit fraction is a rational number written as a fraction where the numerator is one and the denominator is a positive integer. A unit fraction is therefore the reciprocal of a positive integer, 1/''n''. Examples are 1/1, 1/2, 1/3, 1/4, 1/5, etc.

Arithmetic

Elementary arithmetic

Multiplying any two unit fractions results in a product that is another unit fraction:
$\frac1x \times \frac1y = \frac1.$
However, adding, subtracting, or dividing two unit fractions produces a result that is generally not a unit fraction:
$\frac1x + \frac1y = \frac$

$\frac1x - \frac1y = \frac$

$\frac1x \div \frac1y = \frac.$

Modular arithmetic

In modular arithmetic, unit fractions can often be converted into equivalent integers using a calculation based on greatest common divisors. In turn, this conversion can be used to simplify division operations in modular arithmetic, by transforming them into equivalent multiplication operations. Specifically, consider the problem of dividing by a value $x$ modulo $y$. In order for this division to be well defined, $x$ and $y$ must be relatively prime. When they are, the extended Euclidean algorithm for the greatest common divisor can be used to find integers $a$ and $b$ such that Bézout's identity is satisfied:
$\displaystyle ax + by = \gcd(x,y)=1.$
In modulo-$y$ arithmetic, the term $by$ can be eliminated as it is zero modulo $y$. This leaves
$\displaystyle ax \equiv 1 \pmod y.$
That is, $a$ is the modular inverse of $x$, the number that when multiplied by $x$ produces one. Equivalently,
$a \equiv \frac1x \pmod y.$
Thus division by $x$ (modulo $y$) can instead be performed by multiplying by the integer $a$.

Combinations

Finite sums

Any positive rational number can be written as the sum of unit fractions, in multiple ways. For example,
:$\frac45=\frac12+\frac14+\frac1=\frac13+\frac15+\frac16+\frac1.$
The ancient Egyptian civilisations used sums of distinct unit fractions in their notation for more general rational numbers, and so such sums are often called Egyptian fractions. There is still interest today in analyzing the methods used by the ancients to choose among the possible representations for a fractional number, and to calculate with such representations. The topic of Egyptian fractions has also seen interest in modern number theory; for instance, the Erdős–Graham conjecture and the Erdős–Straus conjecture concern sums of unit fractions, as does the definition of Ore's harmonic numbers.

In geometric group theory, triangle groups are classified into Euclidean, spherical, and hyperbolic cases according to whether an associated sum of unit fractions is equal to one, greater than one, or less than one respectively.

Infinite series

Many well-known infinite series have terms that are unit fractions. These include:
* The harmonic series, the sum of all positive unit fractions. This sum diverges, and its partial sums $\frac11 + \frac12 + \frac13 + \cdots + \frac1n$ closely approximate the natural logarithm of $n$ plus the Euler–Mascheroni constant. Changing every other addition to a subtraction produces the alternating harmonic series, which sums to the natural logarithm of 2: $\sum_^\infty \frac = 1 - \frac + \frac - \frac + \frac - \cdots = \ln 2.$
* The Leibniz formula for π is $1 - \frac + \frac - \frac + \frac - \cdots = \frac.$
* The Basel problem concerns the sum of the square unit fractions: $1 + \frac14 + \frac19 + \frac1 + \cdots = \frac.$ Similarly, Apéry's constant is an irrational number, the sum of the cubed unit fractions.
* The binary geometric series is $1 + \frac12 + \frac14 + \frac18 + \frac1 + \cdots = 2.$

Matrices

The Hilbert matrix is the matrix with elements
:$B_ = \frac1.$
It has the unusual property that all elements in its inverse matrix are integers. Similarly, defined a matrix with elements
:$C_ = \frac1,$
where ''F''_i denotes the ''i''th Fibonacci number. He calls this matrix the Filbert matrix and it has the same property of having an integer inverse.

Adjacency and Ford circles

Two fractions $a/b$ and $c/d$ (in lowest terms) are called adjacent if $ad-bc=\pm1$, which implies that their difference $, ad-bc, /bd$ is a unit fraction. For instance, $\tfrac12$ and $\tfrac35$ are adjacent: $1\cdot 5-2\cdot 3=-1$ and $\tfrac35-\tfrac12=\tfrac1$. However, some pairs of fractions whose difference is a unit fraction are not adjacent in this sense: for instance, $\tfrac13$ and $\tfrac23$ differ by a unit fraction, but are not adjacent, because for them $ad-bc=3$. The terminology comes from the study of Ford circles, circles that are tangent to the number line at a given fraction and have the squared denominator of the fraction as their diameter: fractions $a/b$ and $c/d$ are adjacent if and only if their Ford circles are tangent circles.

Applications

In probability and statistics

In a uniform distribution on a discrete space, all probabilities are equal unit fractions. Due to the principle of indifference, probabilities of this form arise frequently in statistical calculations. Additionally, Zipf's law states that, for many observed phenomena involving the selection of items from an ordered sequence, the probability that the ''n''th item is selected is proportional to the unit fraction 1/''n''.

In physics

The energy levels of photons that can be absorbed or emitted by a hydrogen atom are, according to the Rydberg formula, proportional to the differences of two unit fractions. An explanation for this phenomenon is provided by the Bohr model, according to which the energy levels of electron orbitals in a hydrogen atom are inversely proportional to square unit fractions, and the energy of a photon is quantized to the difference between two levels.

Arthur Eddington argued that the fine-structure constant was a unit fraction, first 1/136 then 1/137. This contention has been falsified, given that current estimates of the fine structure constant are (to 6 significant digits) 1/137.036..

See also

* Submultiple

References

External links

*

{{Fractions and ratios

Fractions (mathematics)
1 (number)
Elementary arithmetic
Integers